搜索资源列表
chaper3
- 汉诺塔问题演示程序，点击开始后，程序能按照规则借助B座，将盘子移到C座，简单明了展示-Hanoi Tower problem demo program, click on the start of the program in accordance with the Rules, Block B, will move to C, plates, simple display
HanoiTowerLearningsource
- 汉诺塔学习源码 学习算法，运用了递归的经典应用。 基于.net2.0-Hanoi Tower Learning source learning algorithm, using a recursive application of the classic. Based on. Net2.0
15
- 算法分析与设计中用递归算法求汉诺塔的问题-Algorithm Analysis and Design of recursive algorithm to solve the Hanoi Tower problem
winmine
- VB 编写的河内塔小游戏，带有自动演示游戏功能，可以自动保存用户的游戏成绩，可任意调整游戏界面的大小-Hanoi tower small VB writing, with automatic demo game function, can save the user s game automatically, can adjust the size of the interface
Java
- 骑士走棋盘、八个皇后、八枚银币、生命游戏、字串核对、双色、三色河内塔、背包问题-Knight walking the board, eight queens, eight silver, Game of Life, string matching, two-, three-color Hanoi Tower, knapsack problem, etc.
code
- 使用回溯法解决的典型问题的算法：骑士巡游问题，n皇后问题，0-1背包问题。 使用递归与分治策略解决的几个问题的算法：Hanoi塔问题和二分搜索技术。-Use backtracking to solve the typical problems of algorithms: knight tour problem, n queens problem 0-1 knapsack problem. Use recursion and divide and conquer strategy to so
Hanoi1
- 汉诺塔的一个解决方案，可以输出过程中每一步的结果-One solution to hanoi tower, output the result of each step in the process
RekursifHanoi
- scr ipt to make a Hanoi recursive. This code just shows number of step to complete Hanoi Tower
7_8
- Hanoi（汉诺）塔问题。要求编程序输出移动盘子的步骤。-Hanoi (Hanoi Tower problem). Requirements for the output of the steps to move the plate.
第02次实验
- 求水仙花数；用于解决汉诺塔问题的程序；解决八皇后问题的程序(The number of Narcissus flowers; the program used to solve Hanoi Tower problem; the program to solve the eight queens problem.)